منابع مشابه
DP-Internal NP Movement
In this paper I show that there are clause-like NP-movements within the DP. There have been various proposals for N-movement within the DP (Bernstein 1993, Longobardi 1994 etc.) but none concerning NP-movement. I show that in Bangla (Bengali) at least two types of DP-internal NP movements take place, both of which are due to specificity. The analysis offered, in terms of a difference between nP...
متن کاملAgreement and DP-Internal Feature Distribution
An implicit assumption in most Minimalist work is that DP as a whole carries all the φ-features with which external heads agree. In this paper I argue that under this assumption and the assumption that only a node that is φ-complete can delete the φ-features of a node with which it agrees, Chomsky’s (2000, 2001) model of feature valuation is incompatible with a large body of work on the DPinter...
متن کاملOn Dp-Dp+4 systems, QCD dual and phenomenology
D4-D8 and D3-D7 systems are studied and a possible holographic dual of large N QCD (SU(N) gauge fields and fundamental quarks) is sought. A candidate system is found, for which however no explicit solution is available. Susy is broken by having a D7 − D̄7 condensing to a D5. The mechanism for supersymmetry breaking is then used to try to construct a Standard Model embedding. One can either obtai...
متن کاملRedesigning Tcl-DP
Tcl-DP is a loadable module for Tcl that adds advanced communication features to Tcl/Tk. Tcl-DP supports communication by serial links, IP-multicast, TCP, UDP, and email, contains a remote procedure call (RPC) mechanism, and supports the design of new protocols using modules called filters. Tcl-DP 1.0 [Smi93] was released four years ago and has since been used for numerous commercial and academ...
متن کاملNotes: DP/A*/Information
Coughlan et al hand-designed a template by making it a deformation of a specific hand (his own hand). This was enforced to have a linear structure so that the graph nodes can be ordered and φij(xi, xj) = 0 unless j = i + 1. This gives an open structure on which dynamic programming can be performed over the full energy E(X) = ∑ i φi(f(I; x)) + ∑ i φi,i+1(xi, xi+1). DP is performed as follows. Ex...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ENGLISH LINGUISTICS
سال: 1990
ISSN: 0918-3701,1884-3107
DOI: 10.9793/elsj1984.7.105